Gauss–Galerkin quadrature rules for quadratic and cubic spline spaces and their application to isogeometric analysis

We introduce Gaussian quadrature rules for spline spaces that are frequently used in Galerkin discretizations to build mass and stiffness matrices. By definition, these spaces are of even degrees. The optimal quadrature rules we recently derived (Bartoň and Calo, 2016) act on spaces of the smallest odd degrees and, therefore, are still slightly sub-optimal. In this work, we derive optimal rules directly for even-degree spaces and therefore further improve our recent result. We use optimal quadrature rules for spaces over two elements as elementary building blocks and use recursively the homotopy continuation concept described in Bartoň and Calo (2016) to derive optimal rules for arbitrary admissible numbers of elements. We demonstrate the proposed methodology on relevant examples, where we derive optimal rules for various even-degree spline spaces. We also discuss convergence of our rules to their asymptotic counterparts, these are the analogues of the midpoint rule of Hughes et al. (2010), that are exact and optimal for infinite domains.     

Numerical investigation of lateral earth pressure for unreinforced masonry walls

For the design of unreinforced masonry walls under lateral earth pressure according to DIN EN 1996‐3 [1], the active earth pressure is used, which is less than the earth pressure at rest. For the consideration of active earth pressure, a sufficient deflection of the wall is needed. It is unknown whether the deflections in reality are large enough to justify a reduction of the active earth pressure. Therefore a numerical model has been developed which considers the load‐bearing behaviour of masonry walls, with several boundary conditions being considered to estimate the effective earth pressure.     

An approach to multiplicative linguistic group decision making based on possibility degrees

In order to compare two uncertain multiplicative linguistic variables, a possibility degree formula has been developed and its properties are also studied. Then a possibility degree matrix (also considered as a reciprocal preference relation) is constructed to compare a collection of uncertain multiplicative linguistic variables. Two models are further provided to derive the priority vector from the possibility degree matrix based on the additive consistency and multiplicative consistency. Especially, if the parameters are assigned specific values, then the models reduce to the existing ones. A group decision making method has been developed to deal with the situations where the preferences on alternatives are expressed by uncertain multiplicative linguistic variables. In this method, the possibility degree matrix is first constructed, from which the priority of alternatives is obtained using the developed models. At the end, an example is given to illustrate the proposed method.     

Uncertain impulsive differential systems of fractional order: almost periodic solutions

In this paper, we investigate the existence and stability of almost periodic solutions of impulsive fractional-order differential systems with uncertain parameters. The impulses are realised at fixed moments of time. For the first time, we determine the impact of the uncertainties on the qualitative behaviour of such systems. The main criteria for the existence of almost periodic solutions are proved by employing the fractional Lyapunov method. The global perfect robust uniform-asymptotic stability of such solutions is also considered. We apply our results to uncertain impulsive neural network systems of fractional order.     

Shear resistance of reinforced masonry beams with and without additional concrete or prestress

This article investigates the transferability of the Simplified Modified Compression Field Theory (SMCFT) [2], which is known in reinforced concrete design and included in the fib Model Code for Concrete Structures 2010 (Volume 3) [1], to reinforced or prestressed masonry beams (RM beams) with or without an additional layer of concrete. The investigation for this work is the obsolete shear design concept that has been used until now for reinforced masonry under shear loading, which does not adequately reflect the actual load‐bearing behaviour of significant areas of masonry. The fundamentals of the SMCFT are explained and the transferability of the theory to RM beams is examined, taking into account in particular the different material properties of masonry compared to reinforced concrete. A first approach for future application is represented by the equations presented here for the determination of the shear force capacity of RM beams. The verification is performed through a comparison of the shear resistances determined experimentally (exp.) and by calculation (calc.).     

Lean rules extraction methodology for lean PSS design via key performance indicators monitoring

Lean PSS (Product-Service System) design comprises a promising strategy for delivering sustainable PSS offerings, considering several well-established lean practices. However, automated ways to apply lean practices and more specifically lean rules in industry are limited. This work proposes a methodology for improving the leanness of PSS design, by combining real-time KPI monitoring with lean principles and practices. Through a correlation of typical wastes with the metrics used in the calculation of KPIs, the Total Leanness Index (TLI) of the procedures is defined. Based on automatically identified trade-off values for TLI, lean rules are extracted to improve the performance of PSS lifecycle phases. The proposed lean rules extraction methodology (LeanREM) is validated through a case study of power waste reduction and the concurrently maintenance time decrease in a mould-making company.     

GPU accelerated pivoting rules for the simplex algorithm

Simplex type algorithms perform successive pivoting operations (or iterations) in order to reach the optimal solution. The choice of the pivot element at each iteration is one of the most critical step in simplex type algorithms. The flexibility of the entering and leaving variable selection allows to develop various pivoting rules. In this paper, we have proposed some of the most well-known pivoting rules for the revised simplex algorithm on a CPU–GPU computing environment. All pivoting rules have been implemented in MATLAB and CUDA. Computational results on randomly generated optimal dense linear programs and on a set of benchmark problems (Netlib-optimal, Kennington, Netlib-infeasible, Mészáros) are also presented. These results showed that the proposed GPU implementations of the pivoting rules outperform the corresponding CPU implementations.     

Design of fuzzy expert system for microarray data classification using a novel Genetic Swarm Algorithm

Knowledge gained through classification of microarray gene expression data is increasingly important as they are useful for phenotype classification of diseases. Different from black box methods, fuzzy expert system can produce interpretable classifier with knowledge expressed in terms of if-then rules and membership function. This paper proposes a novel Genetic Swarm Algorithm (GSA) for obtaining near optimal rule set and membership function tuning. Advanced and problem specific genetic operators are proposed to improve the convergence of GSA and classification accuracy. The performance of the proposed approach is evaluated using six gene expression data sets. From the simulation study it is found that the proposed approach generated a compact fuzzy system with high classification accuracy for all the data sets when compared with other approaches.     

Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem

In this paper, we consider the single machine scheduling problem with weighted quadratic tardiness costs. Several efficient dispatching rules are proposed. These include existing heuristics for the linear problem, as well as procedures suitably adapted to the quadratic objective function. Also, both forward and backward scheduling procedures are considered.The computational results show that the heuristics that specifically take into account the quadratic objective significantly outperform their linear counterparts. Also, the backward scheduling approach proves to be superior, and the difference in performance is even more noticeable for the harder instances.The best of the backward scheduling heuristics is both quite efficient and effective. Indeed, this procedure can quickly generate a schedule even for large instances. Also, its relative deviation from the optimum is usually rather low, and it performs adequately even for the more difficult instances.